Florian Heesch & Niall Scott

Cayley Graphs with an Infinite Heesch Number

We construct a 2-generated group Γ such that its Cayley graph possesses finite connected subsets with arbitrarily large finite Heesch number. Thus we obtain an example of a Cayley graph with an infinite Heesch number.

Florian et al_ICMCSSE 2012_3

We here propose improved version of elastic graph matching (EGM) as a face detector, called the multi-scale EGM (MS-EGM). In this improvement, Gabor wavelet-based pyramid reduces computational complexity for the feature representation often used in the conventional EGM, but preserving a critical amount of information about an image. The MS-EGM gives us higher detection performance than Viola-Jo...

Probabilistic Graphical Models - Studienarbeit - Florian

solemnly declare that I have written this master thesis independently, and that I have not made use of any aid other than those acknowledged in this master thesis. Neither this master thesis, nor any other similar work, has been previously submitted to any examination board.

Florian Luca Instituto de Matemáticas

Let σk(n) be the sum of the kth powers of the divisors of n. Here, we prove that if (Fn)n≥1 is the Fibonacci sequence, then the only solutions of the equation σk(Fm) = Fn in positive integers k ≥ 2, m and n have k = 2 and m ∈ {1, 2, 3}. The proof uses linear forms in two and three logarithms, lattice basis reduction, and some elementary considerations.

Viterbi - algorithm – SS 2013 – Florian